<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"
            "http://www.w3.org/TR/REC-html40/loose.dtd">
<HTML>
<HEAD>



<META http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<META name="GENERATOR" content="hevea 1.08">
<LINK rel="stylesheet" type="text/css" href="libman.css">
<TITLE>
The Integer Sets Library
</TITLE>
</HEAD>
<BODY >
<A HREF="libman021.html"><IMG SRC ="previous_motif.gif" ALT="Previous"></A>
<A HREF="index.html"><IMG SRC ="contents_motif.gif" ALT="Up"></A>
<A HREF="libman032.html"><IMG SRC ="next_motif.gif" ALT="Next"></A>
<HR>

<H1 CLASS="chapter"><A NAME="htoc54">Chapter&nbsp;5</A>&nbsp;&nbsp;The Integer Sets Library</H1>

<A NAME="chapfdsets"></A>
<A NAME="@default157"></A>
<BR>
<BR>
The <EM>fd_sets</EM> library is a solver for constraints over the domain
of finite sets of integers. Unlike <EM>conjunto</EM>, it cannot deal with
sets elements that are not integers. On the other hand, fd_sets is usually
faster for integer sets than conjunto.<BR>
<BR>
<UL>
<LI><A HREF="libman026.html">Ground Integer Sets</A>
<LI><A HREF="libman027.html">Set Variables</A>
<UL>
<LI><A HREF="libman027.html#toc31">Declaring</A>
<LI><A HREF="libman027.html#toc32">Printing</A>
<LI><A HREF="libman027.html#toc33">Domain Access</A>
</UL>
<LI><A HREF="libman028.html">Constraints</A>
<UL>
<LI><A HREF="libman028.html#toc34">Membership</A>
<LI><A HREF="libman028.html#toc35">Cardinality</A>
<LI><A HREF="libman028.html#toc36">Set Relations</A>
<LI><A HREF="libman028.html#toc37">N-ary Set Relations</A>
<LI><A HREF="libman028.html#toc38">Set Weights</A>
</UL>
<LI><A HREF="libman029.html">Set Expressions</A>
<LI><A HREF="libman030.html">Search Support</A>
<LI><A HREF="libman031.html">Example</A>
</UL>
<BR>
<BR>
<HR>
<A HREF="libman021.html"><IMG SRC ="previous_motif.gif" ALT="Previous"></A>
<A HREF="index.html"><IMG SRC ="contents_motif.gif" ALT="Up"></A>
<A HREF="libman032.html"><IMG SRC ="next_motif.gif" ALT="Next"></A>
</BODY>
</HTML>
